On Dirichlet's Divisor Plan

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Divisor Products and Proper Divisor Products Sequences*

Let n be a positive integer, Pd(n) denotes the product of all positive divisors of n, qd(n) denotes the product of all proper divisors of n. In this paper, we study the properties of the sequences {PdCn)} and {qd(n)}, and prove that the Makowski &. Schinzel conjecture hold for the sequences {pd(n)} and {qd(n)}.

متن کامل

On Dirichlet ' S Divisor Problem

tact, whereas those for a = 0.02 imply only 25% more frequent contacts than the all-ornone hypothesis but with rather high though rapidly diminishing attack rates. 10 Schuman and Doull, Amer. Jour. Pub. Health, 30, Supplement to March, 1940, p. 21, state: "From these estimates of carrier prevalence and froni the average annual increment in Shick-negatives, an estimate may be made of the number ...

متن کامل

On zero-divisor graphs of quotient rings and complemented zero-divisor graphs

For an arbitrary ring $R$, the zero-divisor graph of $R$, denoted by $Gamma (R)$, is an undirected simple graph that its vertices are all nonzero zero-divisors of $R$ in which any two vertices $x$ and $y$ are adjacent if and only if either $xy=0$ or $yx=0$. It is well-known that for any commutative ring $R$, $Gamma (R) cong Gamma (T(R))$ where $T(R)$ is the (total) quotient ring of $R$. In this...

متن کامل

On bipartite zero-divisor graphs

A (finite or infinite) complete bipartite graph together with some end vertices all adjacent to a common vertex is called a complete bipartite graph with a horn. For any bipartite graph G, we show that G is the graph of a commutative semigroup with 0 if and only if it is one of the following graphs: star graph, two-star graph, complete bipartite graph, complete bipartite graph with a horn. We a...

متن کامل

A survey on the local divisor technique

Local divisors allow a powerful induction scheme on the size of a monoid. We survey this technique by giving several examples of this proof method. These applications include linear temporal logic, rational expressions with Kleene stars restricted to prefix codes with bounded synchronization delay, Church-Rosser congruential languages, and Simon’s Factorization Forest Theorem. We also introduce...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the National Academy of Sciences

سال: 1941

ISSN: 0027-8424,1091-6490

DOI: 10.1073/pnas.27.2.135